Relation-Based Categories are Easier to Learn than Feature-Based Categories

نویسندگان

  • Marc T. Tomlinson
  • Bradley C. Love
چکیده

Relational reasoning is often viewed as the pinnacle of human intelligence. Accordingly, one common viewpoint is that learning categories defined by relational regularities is more difficult than learning categories defined by featural regularities. This view is supported by developmental trends in learning. Studies comparing featural and relational category learning in adults also find a feature advantage, but these studies do not ground featural and relational information in a common perceptual substrate. The current study offers an appropriate comparison between featureand relation-based category learning. Contrary to previous studies, we show how relational learning can be easier. The advantage is attributable to the flexibility of online relational comparisons between a stimulus and a memory representation of a category. Alternative explanations based on difficulties in processing absolute vs. relative stimulus information are ruled out.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supervised and unsupervised learning of multidimensionally varying non-native speech categories

The acquisition of novel phonetic categories is hypothesized to be affected by the distributional properties of the input, the relation of the new categories to the native phonology, and the availability of supervision (feedback). These factors were examined in four experiments in which listeners were presented with novel categories based on vowels of Dutch. Distribution was varied such that th...

متن کامل

Action and hierarchical levels of categories: A connectionist perspective

Recent views of categorization suggest that categories are action-based rather than arbitrary symbols. Three connectionist simulations explore the hierarchical organization of categories in the framework of an action-based theory of categorization. In the simulations an organism with a visual system and a two-segment arm has to reach different points in space depending on the object seen and on...

متن کامل

When learning to classify by relations is easier than by features

Relational reasoning is often considered more resource intensive than featurebased reasoning. This view implies that learning categories defined by relational regularities should be more difficult than learning categories defined by featural regularities. Unfortunately previous studies do not ground featural and relational information in a common perceptual substrate. After addressing this conc...

متن کامل

Probabilistic relational categories are learnable as long as you don’t know you’re learning probabilistic relational categories

Kittur, Hummel and Holyoak (2004) showed that people have great difficulty learning relation-based categories with a probabilistic (i.e., family resemblance) structure. We investigated three interventions hypothesized to facilitate learning family-resemblance based relational categories: Naming the relevant relations, providing a hint to look for a family resemblance structure, and changing the...

متن کامل

بهبود شناسایی موجودیت‌های نامدار فارسی با استفاده از کسره اضافه

Named entity recognition is a process in which the people’s names, name of places (cities, countries, seas, etc.) and organizations (public and private companies, international institutions, etc.), date, currency and percentages in a text are identified. Named entity recognition plays an important role in many NLP tasks such as semantic role labeling, question answering, summarization, machine ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007